Effects, capabilities, and boxes: from scope-based reasoning to type-based reasoning and back
نویسندگان
چکیده
Reasoning about the use of external resources is an important aspect many practical applications. Effect systems enable tracking such information in types, but at cost complicating signatures common functions. Capabilities coupled with escape analysis offer safety and natural signatures, are often overly coarse grained restrictive. We present System C, which builds on generalizes ideas from type-based demonstrates that capabilities effects can be reconciled harmoniously. By assuming all functions second class, we admit for programs. introducing a notion boxed values, lift restrictions second-class values needing to track degree-of-impurity types. The system expressive enough support effect handlers full capacity. practically evaluate C implementation prove its soundness.
منابع مشابه
From case-based reasoning to traces-based reasoning
CBR is an original AI paradigm based on the adaptation of solutions of past problems in order to solve new similar problems. Hence, a case is a problem with its solution and cases are stored in a case library. The reasoning process follows a cycle that facilitates ‘‘learning’’ from new solved cases. This approach can be also viewed as a lazy learning method when applied for task classification....
متن کاملA fuzzy reasoning method based on compensating operation and its application to fuzzy systems
In this paper, we present a new fuzzy reasoning method based on the compensating fuzzy reasoning (CFR). Its basicidea is to obtain a new fuzzy reasoning result by moving and deforming the consequent fuzzy set on the basis of themoving, deformation, and moving-deformation operations between the antecedent fuzzy set and observation information.Experimental results on real-world data sets show tha...
متن کاملINTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING
Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...
متن کاملImproving Agent Performance for Multi-Resource Negotiation Using Learning Automata and Case-Based Reasoning
In electronic commerce markets, agents often should acquire multiple resources to fulfil a high-level task. In order to attain such resources they need to compete with each other. In multi-agent environments, in which competition is involved, negotiation would be an interaction between agents in order to reach an agreement on resource allocation and to be coordinated with each other. In recent ...
متن کاملintegrating case-based reasoning, knowledge-based approach and tsp algorithm for minimum tour finding
imagine you have traveled to an unfamiliar city. before you start your daily tour around the city, you need to know a good route. in network theory (nt), this is the traveling salesman problem (tsp). a dynamic programming algorithm is often used for solving this problem. however, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on programming languages
سال: 2022
ISSN: ['2475-1421']
DOI: https://doi.org/10.1145/3527320